Maximally efficient dialogue mode algorithm

Collaboration is more efficient when the most capable participant for each goal has initiative in directing the problem-solving for that goal. The paper describes a method for using a probabilistic analysis to create a mode-switching mechanism that selects which participant should control the collaborative problem solving so that efficiency is maximized.     

小型水电站联网改造应注意的几个问题

针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析，井提出了改进途径，指出小水电站的联网改造应立足安全，争取效益。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

电离层时域探测方法

给出了各向同性分层半空间等离子体对时域电磁脉冲后向散射的有关公式，得出了反抛物层时域响应的解析表达式，并利用时频分析方法演出了电子密度分布。     

暴雨洪水流域系统随机模拟(研究之三)

本文提出的移置特大暴雨的不连序序列的随机插补方法,以及利用W—H逆变换法将偏态暴雨序列转为正态序列和随机扣除模拟的暴雨过程损失量等方法,基本是可行的,对提高模型的代表性、稳定性和实用性有重要作用。     

采金船采选工艺流程病症诊治专家系统

应用专家系统理论，建立了采金船采选工艺流程病症诊治专家系统，此系统对于采金船采选工艺流程中存在的技术病症，具有诊断、治理及致因分析等功能．     

任意曲线透视投影的逆变换

透视曲线的逆变换是透视图象三维逆变换的重要基础。本文在给出透视投影逆变换基本方程的基础上，分别提出了圆、椭圆、二次曲线、任意平面曲线的透视投影逆变换的解析方法或计算机反求方法。同时给出灭点信息不足明图象的透视参数的准确反求方法。     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.     

A Survey of Inverse Surface Design From Light Transport Behavior Specification

Inverse surface design problems from light transport behavior specification usually represent extremely complex and costly processes, but their importance is well known. In particular, they are very interesting for lighting and luminaire design, in which it is usually difficult to test design decisions on a physical model in order to avoid costly mistakes. In this survey, we present the main ideas behind these kinds of problems, characterize them, and summarize existing work in the area, revealing problems that remain open and possible areas of further research.